Improved upper and lower bound techniques for monotone switching networks for directed connectivity
نویسنده
چکیده
In this paper, we analyze the monotone space of complexity of directed connectivity for a large class of input graphs G using the switching network model. The upper and lower bounds we obtain are a significant generalization of previous results and the proofs involve several completely new techniques and ideas. Acknowledgement: This material is based on work supported by the National Science Foundation Graduate Research Fellowship under Grant No. 0645960.
منابع مشابه
Monotone switching networks for directed connectivity are strictly more powerful than certain-knowledge switching networks
L (Logarithmic space) versus NL (Non-deterministic logarithmic space) is one of the great open problems in computational complexity theory. In the paper “Bounds on monotone switching networks for directed connectivity”, we separated monotone analogues of L and NL using a model called the switching network model. In particular, by considering inputs consisting of just a path and isolated vertice...
متن کاملBounds on the Size of Sound Monotone Switching Networks Accepting Permutation Sets of Directed Trees
Given a directed graph G as input with labeled nodes s and t, the ST-connectivity problem asks whether s and t are connected. The memory efficiency of an algorithm which solves this problem can be analyzed using sound monotone switching networks. This paper concerns bounds on the size of sound monotone switching networks which are restricted to the case that the input graph G is isomorphic to a...
متن کاملQuantum query complexity of graph connectivity
Harry Buhrman et al gave an Ω( √ n) lower bound for monotone graph properties in the adjacency matrix query model. Their proof is based on the polynomial method. However for some properties stronger lower bounds exist. We give an Ω(n3/2) bound for Graph Connectivity using Andris Ambainis’ method, and an O(n3/2 log n) upper bound based on Grover’s search algorithm. In addition we study the adjac...
متن کاملDirected vs. Undirected Monotone Contact Networks for Threshold Functions
we consider the problem of Computing threshold functions wing directed and undirected monotone contact networks. Our main results are the following. First, we show that there exist directed monotone contact networks that compute T,“, 2 5 k 5 n 1, of size O(k(n k + 2)log(n k + 2)). This bound is almost optimal for small thresholds, since there exists an R(knlog(n/(k 1))) lower bound. OUT network...
متن کاملDirected Monotone Contact Networks for Threshold Functions
In this note we consider the problem of computing threshold functions using directed monotone contact networks. We give constructions of monotone contact networks of size (k − 1)(n − k + 2) dlog(n− k + 2)e computing T k , for 2 ≤ k ≤ n − 1. Our upper bound is close to the Ω(kn log(n/(k−1))) lower bound for small thresholds and the k(n−k+1) lower bound for large thresholds. Our networks are desc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1302.3726 شماره
صفحات -
تاریخ انتشار 2013